Alternation theorems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas

In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems, showed that all these problems are either in P or NP-complete, and gave a simple criterion to determine which of the two cases holds. This result is surprising in light of Ladner’s theorem, which implies that there are an infinite...

متن کامل

Empty Alternation

We introduce the notion of empty alternation by investigating alternating automata which are restricted to empty their storage except for a logarithmically space-bounded tape before making an alternating transition. In particular, we consider the cases when the depth of alternation is bounded by a constant or a polylogarithmic function. In this way we get new characterizations of the classes AC...

متن کامل

Task alternation cost without task alternation: measuring intentionality.

A behavioral dissociation between intention and action was demonstrated by patient AF who sustained damage to the left-hemisphere including the basal ganglia. The patient was tested in a task switching paradigm involving two choice reaction-time tasks: SIZE (small/large) and SHAPE (circle/square). The last block in each of the two sessions involved only one task. AF switched tasks reasonably we...

متن کامل

Manner in Dative Alternation

There are a number of well-known restrictions for the Dative Alternation (cf. Green (1974), Oehrle (1976), Gropen, Pinker, Hollander, & Goldberg (1989), Pinker (1989), Pesetsky (1992), Levin (1993). I will show that several of the low-level semantic restrictions are consequences of a more general one involving the incorporation of a manner component into the meaning of the verb. These restricti...

متن کامل

Alternation-based Lexicon Reconstruction

This research is aimed at developing a hierarchical alternation-based lexical architecture for machine translation. The proposed architecture makes extensive use of information sharing in describing valency frames through derivational links from base frames, rather than as independent entities. This has advantages in descriptive efficiency, robustness and maintainability. The lexicon being deve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1976

ISSN: 0021-8693

DOI: 10.1016/0021-8693(76)90035-1